Words have bounded width in
نویسندگان
چکیده
منابع مشابه
Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width
The P4 is the induced path of four vertices. The gem consists of a P4 with an additional universal vertex being completely adjacent to the P4, and the co-gem is its complement graph. Gemand co-gem-free graphs generalize the popular class of cographs (i. e. P4-free graphs). The tree structure and algebraic generation of cographs has been crucial for several concepts of graph decomposition such a...
متن کاملCrossing-number critical graphs have bounded path-width
The crossing number of a graph G, denoted by cr(G), is defined as the smallest possible number of edge-crossings in a drawing of G in the plane. A graph G is crossing-critical if cr(G − e) < cr(G) for all edges e of G. We prove that crossing-critical graphs have “bounded path-width” (by a function of the crossing number), which roughly means that such graphs are made up of small pieces joined i...
متن کاملBounded relational width
We prove that CSP(A) for an idempotent algebra A has bounded relational width if and only if var(A) omits the unary and affine types. If it has bounded relational width it has relational width at most 3. The problem, given a relational structure A, decide if CSP(A) has bounded relational width (equivalently, if the variety generated by the corresponding algebra omits the Boolean and affine type...
متن کاملPolynomials of Bounded Tree-Width
Basic algorithms in real algebraic geometry and their complexity: from Sturm's theorem to the existential theory of reals. polar varieties, real equation solving, and data structures: The hypersurface case. A partial k-arboretum of graphs with bounded tree-width (tutorial). a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines....
متن کاملCongruence Distributivity Implies Bounded Width
We show that a constraint language with compatible Jónnson terms (i.e. associated with an algebra generating a congruence distributive variety) defines a Constraint Satisfaction Problem solvable by the local consistency checking algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Compositio Mathematica
سال: 2019
ISSN: 0010-437X,1570-5846
DOI: 10.1112/s0010437x19007334